A Continuous Analogue of Lattice Path Enumeration

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice path enumeration and Toeplitz matrices

This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Schröder numbers. We identify lattice paths with walks on some path-like graph. The entries of the nth power of the adjacency matrix are the number of paths of length nwith prescribed start and end position. The adjacency matrices turn out to be Toeplitz matrices. Explicit expressions for eigenvalu...

متن کامل

A Factorization for Formal Laurent Series and Lattice Path Enumeration

If f = EW:-, a,,t” is a formal Laurent series with certain restrictions on the a,, then f = f-fof+ , where fcontains only negative powers of t, f+ contains only positive powers of t, and f. is independent of t. Applications include Lagrange’s formula for series reversion, the problem of counting lattice paths below a diagonal, and a theorem of Furstenberg that the diagonal of a rational power s...

متن کامل

A generalized Goulden-Jackson cluster method and lattice path enumeration

The Goulden–Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which generalize the combinatorial framework of free monoids. As a sample application of the generalized cluster method, we compute bivariate and multivariate gen...

متن کامل

COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS

The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...

متن کامل

computational enumeration of point defect clusters in double- lattice crystals

the cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [i, 2]. point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. the method of representation matrices is extended to make it applicable to represent and enumerate the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2019

ISSN: 1077-8926

DOI: 10.37236/8788